Estimation of polynomial roots by continued fractions

نویسنده

  • Petr Klán
چکیده

One of the ways to describe dynamical characteristics of the system is the s-transfer function, which belongs to the class of the so-called external descriptions and from the mathematical point of view it represents a rational function. Decomposition into the partial fractions (sum of exponential functions in the time domain) is based on the knowledge of the roots of the polynomial defined by the denominator of the transfer function; from their location it is possible to deduce dynamical characteristics, system stability, etc. The numerator roots position indicates the phase characteristic of the system. There exists a large number of successful methods for calculating the polynomial roots (for instance Lehmer-Shur, Bairstow, Graef, Bernoullia, Newton-Raphson and many others). The method described here is based on Viskovatoff's decomposition of a rational function, and makes use of the continued fraction theory and the characteristic root loci construction proposed by Evans. In the second part of this paper two existing methods are discussed for approximate finding of the polynomial roots through the construction of characteristic root loci. Each of them is illustrated by a simple solved example. In the third part a short introducion to the analytic theory of continued fractions is given. It contains necessary conclusions for the proposed method and is also completed by a solved example. In the fourth part the general algorithm is given and a sample solution is explored. The final part provides a comparison with other methods, the possibility of algorithmization, characteristic root loci construction on microcomputers, etc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continued Fractions with Multiple Limits

For integers m ≥ 2, we study divergent continued fractions whose numerators and denominators in each of the m arithmetic progressions modulo m converge. Special cases give, among other things, an infinite sequence of divergence theorems, the first of which is the classical Stern-Stolz theorem. We give a theorem on a class of Poincaré type recurrences which shows that they tend to limits when th...

متن کامل

Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds

We present an implementation of the Continued Fractions (CF) real root isolation method using a recently developed upper bound on the positive values of the roots of polynomials. Empirical results presented in this paper verify that this implementation makes the CF method always faster than the Vincent-Collins-Akritas bisection method, or any of its variants.

متن کامل

Improving the Performance of the Continued Fractions Method Using New Bounds of Positive Roots

Abstract. In this paper we compare four implementations of the Vincent-AkritasStrzeboński Continued Fractions (VAS-CF) real root isolation method using four different (two linear and two quadratic complexity) bounds on the values of the positive roots of polynomials. The quadratic complexity bounds were included to see if the quality of their estimates compensates for their quadratic complexity...

متن کامل

Improved complexity bounds for real root isolation using Continued Fractions

We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a novel way to compute a lower bound on the positive real roots of univariate polynomials. This allows us to derive a worst case bound of ÕB(d + dτ + dτ) for isolating the real roots of a polynomial with integer coeffic...

متن کامل

logcf: An Efficient Tool for Real Root Isolation

This paper revisits an algorithm for isolating real roots of univariate polynomials based on continued fractions. It follows the work of Vincent, Uspensky, Collins and Akritas, Johnson and Krandick. We use some tricks, especially a new algorithm for computing an upper bound of positive roots. In this way, the algorithm of isolating real roots is improved. The complexity of our method for comput...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Kybernetika

دوره 21  شماره 

صفحات  -

تاریخ انتشار 1985